Preserving approximation in the Min—Weighted Set Cover Problem
نویسندگان
چکیده
منابع مشابه
Packing-Based Approximation Algorithm for the k-Set Cover Problem
We present a packing-based approximation algorithm for the k-Set Cover problem. We introduce a new local search-based k-set packing heuristic, and call it Restricted k-Set Packing. We analyze its tight approximation ratio via a complicated combinatorial argument. Equipped with the Restricted k-Set Packing algorithm, our k-Set Cover algorithm is composed of the k-Set Packing heuristic [7] for k ...
متن کاملComplexity and approximation of the connected set-cover problem
In this paper, we study the computational complexity and approximation complexity of the connected set-cover problem. We derive necessary and sufficient conditions for the connected set-cover problem to have a polynomial-time algorithm. We also present a sufficient condition for the existence of a (1 + ln δ)-approximation. In addition, one such (1 + ln δ)-approximation algorithm for this proble...
متن کاملAn Approximation Algorithm for the Minimum Latency Set Cover Problem
The input to the minimum latency set cover problem (MLSC) consists of a set of jobs and a set of tools. Each job j needs a specific subset Sj of the tools in order to be processed. It is possible to install a single tool in every time unit. Once the entire subset Sj has been installed, job j can be processed instantly. The problem is to determine an order of job installations which minimizes th...
متن کاملThe Pipelined Set Cover Problem
A classical problem in query optimization is to find the optimal ordering of a set of possibly correlated selections. We provide an abstraction of this problem as a generalization of set cover called pipelined set cover, where the sets are applied sequentially to the elements to be covered and the elements covered at each stage are discarded. We show that several natural heuristics for this NP-...
متن کاملA Θ(log n)-approximation for the Set Cover Problem with Set Ownership
In highly distributed Internet measurement systems distributed agents periodically measure the Internet using a tool called traceroute, which discovers a path in the network graph. Each agent performs many traceroute measurements to a set of destinations in the network, and thus reveals a portion of the Internet graph as it is seen from the agent locations. In every period we need to check whet...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1997
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(96)00047-9